When Bingham meets Bratu: mathematical and computational investigations
نویسندگان
چکیده
In this article, we discuss the numerical solution of Bingham-Bratu-Gelfand (BBG) problem, a non-smooth nonlinear eigenvalue problem associated with total variation integral and an exponential nonlinearity. Using fact that one can view as possible Lagrange multiplier constrained minimization from Calculus Variations, associate BBG initial value (dynamical flow), well suited to time-discretization by operator-splitting. Various mathematical results are proved, including convergence finite element approximation problem. The operator-splitting/finite methodology discussed in article is robust easy implement. We validate implementation first solving classical Bratu-Gelfand obtaining reporting consistent those found literature. then explore full capability viscoplastic for several values plasticity yield. conclude exhibiting discussing bifurcation diagrams corresponding these same yield, examining some finer details solver discovered during course our investigation.
منابع مشابه
When the Generative Lexicon meets Computational Semantics
Computational semantics and lexical semantics have so far mostly been studied separately. As a result, computational semantics often constructs meanings with poor or little lexical sense, while lexical semantics generally only apply to simple and small phrases (as opposed to complete sentences). We present here a general framework to incorporate lexical semantics information originating from a ...
متن کاملWhen Turing Meets Milner
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...
متن کاملWhen Simulation Meets Antichains
We describe a new and more efficient algorithm for checking universality and language inclusion on nondeterministic finite word automata (NFA) and tree automata (TA). To the best of our knowledge, the antichain-based approach proposed by De Wulf et al. was the most efficient one so far. Our idea is to exploit a simulation relation on the states of finite automata to accelerate the antichain-bas...
متن کاملWhen mind meets machine
into sufferers from amyotrophic lateral sclerosis (ALS) and brain-stem stroke, which enables them to move a computer cursor, albeit slowly. The device uses electrodes attached to amplifiers and FM transmitters transplanted 5 mm deep—just under the scalp—into the brain. The electrodes encourage brain tissue to grow around them, thus stabilizing them against any movement and resulting distortion ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ESAIM: Control, Optimisation and Calculus of Variations
سال: 2021
ISSN: ['1262-3377', '1292-8119']
DOI: https://doi.org/10.1051/cocv/2021020